Laser Radar Data Registration Algorithm Based on DBSCAN Clustering
نویسندگان
چکیده
At present, the core of lidar data registration algorithms depends on search correspondence, which has become factor limiting performance this kind algorithm. For point-based algorithms, coincidence rate is too low, and for line-based method searching correspondence complex unstable. In paper, a laser radar algorithm based DBSCAN (Density-Based Spatial Clustering Applications with Noise) clustering proposed, avoids establishment corresponding relationship. Firstly, ring band filter designed to process outliers noise in point cloud. Then, adaptive threshold used extract line segment features cloud be registered, density obtain key clusters rotation angle translation matrix. order evaluate similarity two frames after registration, kernel estimation proposed describe registered cloud, K-L divergence find optimal value clusters. The experimental results show that direct between points or lines scenes many clouds, can effectively improve robustness suppress influence relative error result actual within 10%, accuracy better than ICP
منابع مشابه
Fuzzy Core DBScan Clustering Algorithm
In this work we propose an extension of the DBSCAN algorithm to generate clusters with fuzzy density characteristics. The original version of DBSCAN requires two parameters (minPts and ) to determine if a point lies in a dense area or not. Merging different dense areas results into clusters that fit the underlined dataset densities. In this approach, a single density threshold is employed for a...
متن کاملG-DBSCAN: A GPU Accelerated Algorithm for Density-based Clustering
With the advent of Web 2.0, we see a new and differentiated scenario: there is more data than that can be effectively analyzed. Organizing this data has become one of the biggest problems in Computer Science. Many algorithms have been proposed for this purpose, highlighting those related to the Data Mining area, specifically the clustering algorithms. However, these algorithms are still a compu...
متن کاملPrivacy Preserving DBSCAN Algorithm for Clustering
In this paper we address the issue of privacy preserving clustering. Specially, we consider a scenario in which two parties owning confidential databases wish to run a clustering algorithm on the union of their databases, without revealing any unnecessary information. This problem is a specific example of secure multi-party computation and as such, can be solved using known generic protocols. H...
متن کاملKrill Herd Clustering Algorithm using DBSCAN Technique
The hybrid approach is proposed to show that the clusters also show the swarm behavior. Krill herd algorithm is used to show the simulation of the herding behavior of the krill individuals. Density based approach is used for discovering the clusters and to show the region with sufficiently high density into clusters of krill individuals that of the arbitrary shape in environment. The minimum di...
متن کاملRadar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm
This paper discusses a novel approach to associate and re ne aircraft track data from multiple radar sites. The approach provides enhanced aircraft track accuracy and time synchronization that is compatible with modern air tra c management analysis and simulation tools. Unlike existing approaches where the number of aircraft in the radar data must be assumed, this approach requires no such prio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12061373